Game theoretic pricing models in hotel revenue management: An equilibrium choice-based conjoint analysis approach

A Discrete Stochastic Approach to Hotel Revenue Management

  A linear programming model has been presented for finding an appropriate planning in order to maximize hotel revenue. In this model, a special planning horizon has been considered that includes several busy days of a year. There are several reservation periods that may start a few months earlier. Each period of reservation may have different prices and so result different incomes. Hotel custo...

Competitive Pricing in a Supply Chain Using a Game Theoretic Approach

We develop a price competition model for a new supply chain that competes in a market comprised of some rival supply chains. The new supply chain has one risk-neutral manufacturer and one risk-averse retailer in which the manufacturer is a leader and retailer is a follower. The manufacturer pays a fraction of the risk cost (caused by demand uncertainty) to the retailer. We apply this competitiv...

Choice Based Conjoint Analysis: Discrete Choice Models vs. Direct Regression

Conjoint analysis is family of techniques that originated in psychology and later became popular in market research. The main objective of conjoint analysis is to measure an individual’s or a population’s preferences on a class options that can be described by parameters and their levels. We consider preference data obtained in choice based conjoint analysis studies, where one observes test per...

Revenue management and seller pricing decisions in retail industry: An agent-based model

Dynamic Pricing for Network Revenue Management: A New Approach and Application in the Hotel Industry

Dynamic pricing for network revenue management has received considerable attention in research and practice. Based on data obtained from a major hotel, we use a large-scale numerical study to compare the performance of several heuristic approaches proposed in the literature. The heuristic approaches we consider include deterministic linear programming with resolving and three variants of dynami...